#include"BinarySearchTree.h"
#include"BinarySearchTree_KV.h"
#include<iostream>
using namespace std;

void TestBSTree1()
{
	int a[] = { 8, 3, 1, 10, 6};
	key::BSTree<int> t1;
	for (auto e : a)
	{
		t1.Insert(e);
	}

	t1.InOrder();
	

	t1.erase(8);
	
	t1.InOrder();
}



int main()
{
	//TestBSTree1();

	key_value::TestBSTree2();
	key_value::TestBSTree3();


	return 0;
}

